n = int(input())
d = [list(map(int, input().split())) for _ in range(n)]
e = list(zip(*d))
c = 0
for i in range(n):
for j in range(n):
if sum(d[i]) < sum(e[j]):
c += 1
print(c)#include <bits/stdc++.h>
using namespace std;
#define beshoo ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
long long sum1,sum2,c,mx,mn,t;
bool z=0;
set<long long>se;
vector<long long>v;
map<pair<long long,long long>,long long>mp;
set<long long>::iterator its=se.begin();
map<pair<long long,long long>,long long>::iterator itm=mp.begin();
int main()
{
beshoo
int n;cin>>n;int arr1[n]={},arr2[n]={};
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
int x;cin>>x;
arr1[i]+=x;
arr2[j]+=x;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(arr2[j]>arr1[i])c++;
}
}
cout<<c;
return 0;
}
// Our functions
long long factorial(long long x)
{
long long fact=1;for(long long i=1;i<=x;i++){fact*=i;}
return fact;
}
long long permutations(long long x,long long y)
{
long long fact1=1;for(long long i=1;i<=max(x,y);i++){fact1*=i;}
long long fact2=1;for(long long i=1;i<=abs(x-y);i++){fact2*=i;}
return fact1/fact2;
}
long double combinations(long double x,long double y)
{
long double ans =1;
for(long double i=0,w=min(y,abs(x-y));i<w;i++){ans =(ans*(x-i))/(i+1);}
return ans;
}
bool isprime(long long n)
{
if(n<2||n%2==0)return false;
if(n==2)return true;
for(long long i=3;i<=sqrt(n);i+=2){if(n%i==0)return false;}
return true;
}
//Done bro561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |